Sparse Signal Recovery from Quadratic Measurements via Convex Programming
نویسندگان
چکیده
منابع مشابه
Sparse Signal Recovery from Quadratic Measurements via Convex Programming
In this paper we consider a system of quadratic equations |〈zj ,x〉|2 = bj , j = 1, ...,m, where x ∈ R is unknown while normal random vectors zj ∈ R and quadratic measurements bj ∈ R are known. The system is assumed to be underdetermined, i.e., m < n. We prove that if there exists a sparse solution x i.e., at most k components of x are non-zero, then by solving a convex optimization program, we ...
متن کاملPhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
Suppose we wish to recover a signal x ∈ C from m intensity measurements of the form |〈x, zi〉|, i = 1, 2, . . . ,m; that is, from data in which phase information is missing. We prove that if the vectors zi are sampled independently and uniformly at random on the unit sphere, then the signal x can be recovered exactly (up to a global phase factor) by solving a convenient semidefinite program—a tr...
متن کاملSparse Signal Recovery from Nonadaptive Linear Measurements
The theory of Compressed Sensing , the emerging sampling paradigm ‘that goes against the common wisdom’ , asserts that ‘one can recover signals in R from far fewer samples or measurements , if the signal has a sparse representation in some orthonormal basis, from m ≈ O(klogn), k ≪ n nonadaptive measurements . The accuracy of the recovered signal is as good as that attainable with direct knowled...
متن کامل`1-magic : Recovery of Sparse Signals via Convex Programming
For maximum computational efficiency, the solvers for each of the seven problems are implemented separately. They all have the same basic structure, however, with the computational bottleneck being the calculation of the Newton step (this is discussed in detail below). The code can be used in either “small scale” mode, where the system is constructed explicitly and solved exactly, or in “large ...
متن کاملRecovery of Sparse Probability Measures via Convex Programming
We consider the problem of cardinality penalized optimization of a convex function over the probability simplex with additional convex constraints. The classical `1 regularizer fails to promote sparsity on the probability simplex since `1 norm on the probability simplex is trivially constant. We propose a direct relaxation of the minimum cardinality problem and show that it can be efficiently s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Mathematical Analysis
سال: 2013
ISSN: 0036-1410,1095-7154
DOI: 10.1137/120893707